Remarks on General Fibonacci Number
نویسنده
چکیده
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one. Although it seems the topic in the first section has already been covered before, but we present a different proof here. Later I found out that, the auxiliary theorem used in the first section was proven and even generalized further by F. T. Howard(5). Thanks to Curtis Cooper(2) for pointing out the fact that this has already been studied and providing me with references. For further studies on the literature, one can study (7) and (7). the At first, we prove that, only the common general Fibonacci Sequence can be a divisible sequence under some restrictions. In the latter part, we find some properties of the sequence, prove that there are infinite alternating bisquable Fibonacci sequence(defined later) and provide a lower bound on the number of divisors of Fibonacci numbers.
منابع مشابه
Some Properties of the Singular Words of the Fibonacci Word
The combinatorial properties of the Fibonacci innnite word are of great interest in some aspects of mathematics and physics, such as number theory, fractal geometry, formal language, computational complexity , quasicrystals etc. In this note, we introduce the singular words of the Fibonacci innnite word and discuss their properties. We establish two decompositions of the Fibonacci word in singu...
متن کاملSome Remarks on Fibonacci Matrices
In [1], Dazheng studies Fibonacci matrices, namely matrices M such that every entry of every positive power of M is either 0 or plus or minus a Fibonacci number. He gives 40 such four-byfour matrices. In the following, we give an interpretation of these matrices, from which we give simpler proofs of several of his theorems. We also determine all two-by-two Fibonacci matrices. Let £ = e be a pri...
متن کاملIndependent subsets of powers of paths, and Fibonacci cubes
We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the hth power of a path ordered by inclusion. For h = 1 such a value is the number of edges of a Fibonacci cube. We show that, in general, the number of edges of the diagram is obtained by convolution of a Fibonacci-like sequence with itself.
متن کاملCOMPUTATIONAL RESULTS ON FINITE P-GROUPS OF EXPONENT P2
The Fibonacci lengths of the finite p-groups have been studied by R. Dikici and co-authors since 1992. All of the considered groups are of exponent p, and the lengths depend on the celebrated Wall number k(p). The study of p-groups of nilpotency class 3 and exponent p has been done in 2004 by R. Dikici as well. In this paper we study all of the p-groups of nilpotency class 3 and exponent p2. Th...
متن کاملFibonacci Index and Stability Number of Graphs: a Polyhedral Study
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and the order of general graphs and connected graphs. Turán graphs frequently appear in extremal graph theory. We show that Turán graphs and a conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015